Computational complexity theory

Results: 2049



#Item
901Linear algebra / NP-complete problems / Matrix theory / Computational complexity theory / Graph partition / Approximation algorithm / Algorithm / Graph theory / Eigenvalues and eigenvectors / Mathematics / Algebra / Theoretical computer science

Approximate Computation and Implicit Regularization for Very Large-scale Data Analysis Michael W. Mahoney Department of Mathematics Stanford University Stanford, CA 94305

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2012-05-21 20:27:46
902Inspec / Computational and Mathematical Organization Theory / Journal of Mathematical Biology / Publishing / Academic publishing / Mass media

Leidimo metai: 2012; Institucijoje pareigas užimantys autoriai. I lygio padalinys: 580000 – VU Matematikos ir informatikos institutas; MOKSLINĖS PUBLIKACIJOS MONOGRAFIJOS 1. Jukna, Stasys. Boolean Function Complexity

Add to Reading List

Source URL: www.mii.lt

Language: English - Date: 2015-02-04 10:03:32
903Artificial intelligence / Algorithmic information theory / Theory of computation / Ray Solomonoff / Computability theory / Algorithm / Computational complexity theory / Complexity / NP / Theoretical computer science / Applied mathematics / Mathematics

A SYSTEM FOR INCREMENTAL LEARNING BASED ON ALGORITHMIC PROBABILITY Ray J. Solomonoff ∗ Computer Learning Research Center Royal Holloway, University of London Mailing Address: P.O.B, Cambridge, Ma, U.S.A.

Add to Reading List

Source URL: world.std.com

Language: English - Date: 2014-09-17 03:58:53
904Complexity classes / Community websites / Mathematical optimization / Conjectures / P versus NP problem / Structural complexity theory / Stack Exchange Network / NP-complete / NP / Theoretical computer science / Computational complexity theory / Applied mathematics

Questions Answered. In Theory. http://cstheory.stackexchange.com∗ Perhaps you’re a computer scientist wondering how much the Axiom of Choice matters to the theorems you study and prove[21]. Perhaps you’re a mathema

Add to Reading List

Source URL: www.cs.utah.edu

Language: English - Date: 2010-11-05 18:41:12
905Computational complexity theory / Finite model theory / Circuit complexity / Clique problem / Clique / Wilhelm Ackermann / Logic / Switching lemma / Descriptive complexity theory / Theoretical computer science / Mathematics / Applied mathematics

The Ackermann Award 2011 Report of the Jury The seventh Ackermann Award will be presented at this CSL’11, held in Bergen, Norway. This is the fifth year the EACSL Ackermann Award is generously sponsored. Our sponsor f

Add to Reading List

Source URL: eacsl.kahle.ch

Language: English - Date: 2013-12-08 17:58:05
906Mathematical optimization / Operations research / Complexity classes / Structural complexity theory / Job shop scheduling / NP / Algorithm / Time complexity / Approximation algorithm / Theoretical computer science / Applied mathematics / Computational complexity theory

SOP TRANSACTIONS ON APPLIED MATHEMATICS Accepted version, see http://www.scipublish.com/journals/AM/papers/1097 for published version. Approximation Algorithms for Subclasses of the Makespan Problem on Unrelated Parallel

Add to Reading List

Source URL: drpage.pagewizardgames.com

Language: English - Date: 2015-02-07 18:05:03
907Computability theory / Complexity classes / Models of computation / Theory of computation / Obfuscated code / Algorithm / Oracle machine / Pseudorandom function family / Computability / Theoretical computer science / Applied mathematics / Computational complexity theory

On the (Im)possibility of Obfuscating Programs∗ Boaz Barak† Oded Goldreich‡ Amit Sahaik

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2010-07-29 14:23:20
908Artificial intelligence / Ray Solomonoff / Computational complexity theory / Inductive reasoning / Reduction / Problem of induction / Science / Knowledge / Epistemology

TR IDSIA–16–03, revision 2.0; 30 October 2003 Progress In Incremental Machine Learning Ray J. Solomonoff

Add to Reading List

Source URL: world.std.com

Language: English - Date: 2014-09-18 21:26:32
909Computational complexity theory

Small Polynomial Path Orders in TCT∗ Martin Avanzini1 , Georg Moser1 , and Michael Schaper1 1 Institute of Computer Science, University of Innsbruck, Austria

Add to Reading List

Source URL: www.imn.htwk-leipzig.de

Language: English - Date: 2013-08-26 10:13:12
    910Circuit complexity / Computational complexity theory / Complexity classes / AC / Clique / Parity function / Boolean circuit / Matching / Circuit / Theoretical computer science / Mathematics / Graph theory

    On Graph Complexity S . J U K N A† Universit¨ at Frankfurt, Institut f¨ ur Informatik

    Add to Reading List

    Source URL: lovelace.thi.informatik.uni-frankfurt.de

    Language: English - Date: 2009-01-04 06:50:40
    UPDATE